Public Key Cryptography and the RSA Cryptosystem
نویسنده
چکیده
Cryptography, or cryptology, is a subject that is concerned with privacy or confidentiality of communication over insecure channels, in the presence of adversaries. It seeks to find ways to encrypt messages so that even if an unauthorized party gets a hold of a message, they cannot make sense out of it. The ways to break encryption systems, called cryptanalysis, is also part of the subject. Cryptography is sometimes confused with the related but distinct field of coding theory that deals with reliability of communication over noisy channels. See the author’s earlier module titled “An introduction to coding theory via Hamming codes” for an introduction to coding theory. There are two basic methods in cryptography: classical cryptography and public key cryptography. The latter is a more recent idea and this module will focus on that method through one of its best known and widely used examples: RSA cryptosystem. Proposed in 1977, the RSA cryptosystem has survived many attacks and is still commonly used.
منابع مشابه
QTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملOn the Efficiency of Fast RSA Variants in Modern Mobile Phones
Modern mobile phones are increasingly being used for more services that require modern security mechanisms such as the public-key cryptosystem RSA. It is, however, well-known that public-key cryptography demands considerable computing resources and that RSA encryption is much faster than RSA decryption. It is consequently an interesting question if RSA as a whole can be executed efficiently on ...
متن کاملNumber Theory and the RSA Public Key Cryptosystem
This tutorial uses Sage to study elementary number theory and the RSA public key cryptosystem. A number of Sage commands will be introduced that help us to perform basic number theoretic operations such as greatest common divisor and Euler’s phi function. We then introduce the RSA cryptosystem and use Sage’s built-in commands to encrypt and decrypt data via the RSA algorithm. Please note that t...
متن کاملApproaches in RSA Cryptosystem using Artificial Neural Network
RSA cryptosystem, the first public key cryptography presented in 1977. Neural networks are often used as a powerful discriminating estimator for tasks in function approximation. This paper describes a neural-network-based method relies on Radial Basis Function and Levenberg-Marquardt Backpropagation for estimating the behavior of the function used in RSA cryptosystem to calculate the function. ...
متن کاملThree Novel Theorems for Applied Cryptography
With advancements in computing capabilities public key cryptosystems are going to be more complex yet vulnerable over the modern day‟s computer networks and associated security mechanism, especially those based on novel approaches of applied mathematics. This paper explores three novel theorems derived while studying and implementing RSA algorithm, one of the strongest public key cryptosystem. ...
متن کامل